Optimal routing policies in deterministic queues in tandem
نویسندگان
چکیده
In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time of the whole system. We show that the optimal routing is a Sturmian word which density depends on maximum service time on each route. In order to do this, we particularly study the output process of deterministic queues when the input process is Sturmian.
منابع مشابه
Optimal Routing in Several Deterministic Queues with Two Service Times
In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues. RÉSUMÉ. Cet article présente diverses extentions des problèmes de routages optimaux dans des files d’attentes déterministes en parallèle. Notre objectif ...
متن کاملOptimal control of tandem reentrant queues
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the lastbuffer-first-served (LBFS) policy stochastically maximizes the departure process.
متن کاملOptimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of ` (resp., k) packets, for arbitrary values of ` and k. All our algorithms run in optimal O (√ `kn ) time and use queues of on...
متن کاملA New Ordering for Stochastic Majorization: Theory and Applications
In this paper, we develop a uniied approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings deened in Marshall and Olkin, by deening a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing determin...
متن کاملOptimal routing in two-queue polling systems
We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times with rate μ in each queue. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007